Short running title: A generating function approach A GENERATING FUNCTION APPROACH TO COUNTING THEOREMS FOR SQUARE-FREE POLYNOMIALS AND MAXIMAL TORI
نویسندگان
چکیده
A recent paper of Church, Ellenberg, and Farb uses topology and representation theory of the symmetric group to prove enumerative results about square-free polynomials and F -stable maximal tori of GLn(Fq). In this note, we use generating functions to give short, elementary proofs of some of their results, and some extensions.
منابع مشابه
Hopf Algebras and Edge-labeled Posets
Given a finite graded poset with labeled Hasse diagram, we construct a quasi-symmetric generating function for chains whose labels have fixed descents. This is a common generalization of a generating function for the flag f -vector defined by Ehrenborg and of a symmetric function associated to certain edge-labeled posets which arose in the theory of Schubert polynomials. We show this constructi...
متن کاملHopf Algebras and Edge-labeled Posets
Given a nite graded poset with labeled Hasse diagram, we construct a quasi-symmetric generating function for chains whose labels have xed descents. This is a common generalization of a generating function for the ag f-vector de-ned by Ehrenborg and of a symmetric function associated to certain edge-labeled posets which arose in the theory of Schubert polynomials. We show this construction gives...
متن کاملGenerating family invariants for Legendrian links of unknots
Theory is developed for linear-quadratic at infinity generating families for Legendrian knots in R3 . It is shown that the unknot with maximal Thurston–Bennequin invariant of −1 has a unique linear-quadratic at infinity generating family, up to fiber-preserving diffeomorphism and stabilization. From this, invariant generating family polynomials are constructed for 2–component Legendrian links w...
متن کاملPartitions into Even and Odd Block Size and Some Unusual Characters of the Symmetric Groups
For each n and k, let rfr' denote the poset of all partitions of n having every block size congruent to / mod k. Attach to n£•*' a unique maximal or minimal element if it does not already have one, and denote the resulting poset U%-\ Results of Bjorner, Sagan, and Wachs show that Yl^' and nj, are lexicographically shellable, and hence Cohen-Macaulay. Let /3^ and /jl' * denote the characters of ...
متن کاملOn the unimodality of independence polynomials of very well-covered graphs
The independence polynomial i(G, x) of a graph G is the generating function of the numbers of independent sets of each size. A graph of order n is very well-covered if every maximal independent set has size n/2. Levit and Mandrescu conjectured that the independence polynomial of every very well-covered graph is unimodal (that is, the sequence of coefficients is nondecreasing, then nonincreasing...
متن کامل